DNA Sequence Alignment by Parallel Dynamic Programming
نویسندگان
چکیده
Of late Molecular biology is becoming increasingly dependent on computer science algorithms as research tools. The process of aligning DNA sequences is widely used in modern biological sciences. Genetics databases hold extremely large amount of raw data. The human genome alone has approximately 3 billion DNA base pairs. To search through all this data and to find meaningful relationships in it, molecular biologists are depending more and more on efficient computer science string algorithms. This paper introduces a parallel multithreaded algorithm to improve upon the time of the traditional DNA sequence alignment algorithms.
منابع مشابه
gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملAn Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملImplementation of a Dynamic Programming Algorithm for Dna Sequence Alignment on the Cell Matrix Architecture
DNA sequence alignment is an important tool for modern molecular biology. The algorithm used by most sequence alignment tools is the dynamic programming algorithm introduced by Needleman and Wunsch in 1970. This algorithm has a time complexity of O(n 2), where n is the length of the input sequence. This dynamic programming algorithm has been implemented on a new parallel computing architecture ...
متن کاملA Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences
This paper presents a Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences. DNA sequence alignment between two or more bio sequences using algorithms is a complex problem due to its applicability in the field of biology. This algorithm achieves its efficiency in using computational resources by making a M X N matrix , M represents the length of first sequence and N represe...
متن کاملEfficient Parallel Design for Edit distance algorithm in DNA Sequence Alignment
The focus of Bioinformatics research is usually on two aspects—genomics and proteomics, specifically, it’s starting from nucleic acid and protein sequences, analyzing the structural and functional biological information expressed in the sequences. Biological sequence alignment is one of the common problems, the NeedlemanWunsch algorithm based on dynamic programming is the most basic algorithm, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010